Invariant rational functions, linear fractional transformations and irreducible polynomials over finite fields

نویسندگان

چکیده

For a subgroup of PGL(2,q) we show how some irreducible polynomials over Fq arise from the field invariant rational functions. The proofs rely on combining two actions PGL(2,F), one projective line F and other function F(x). functions in F(x) are used to that regular patterns exist factorization certain into polynomials. We use results about group orbit polynomial, whose included.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irreducible Polynomials over Finite Fields

As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...

متن کامل

Generators and irreducible polynomials over finite fields

Weil’s character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of Hansen-Mullen.

متن کامل

Construction of Irreducible Polynomials over Finite Fields

In this paper we investigate some results on the construction of irreducible polynomials over finite fields. Basic results on finite fields are introduced and proved. Several theorems proving irreducibility of certain polynomials over finite fields are presented and proved. Two theorems on the construction of special sequences of irreducible polynomials over finite fields are investigated in de...

متن کامل

Constructing irreducible polynomials over finite fields

We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev’s density theorem.

متن کامل

Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields

We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1, . . . , |S|} and the set S of all irreducible, monic, univariate polynomials of degree n over a finite field Fq. This has applications in pseudorandomness, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2022

ISSN: ['1090-2465', '1071-5797']

DOI: https://doi.org/10.1016/j.ffa.2021.101991